A numerical algorithm for finding solutions of a generalized Nash equilibrium problem
نویسندگان
چکیده
منابع مشابه
A numerical algorithm for finding solutions of a generalized Nash equilibrium problem
A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical b...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA generalized Nash equilibrium for a bioeconomic problem of fishing
With the overexploitation of many conventional fish stocks, and growing interest in harvesting new kinds of food from the sea, there is an increasing need for managers of fisheries to take account of interactions among species. In this work we define a bioeconomic equilibrium model for ’n’ fishermen who catch three species; these species compete with each other for space or food. The natural gr...
متن کاملFinding a simple Nash Equilibrium
Non-cooperative game theory has been tightly combined with Computational Methods, in which the Nash Equilibrium (NE) is undoubtedly the most important solution concept. While players face several Nash Equilibriums, their most pragmatic strategy may not be the most optimal one, but one they prefer for other reasons. Players may choose a sub-optimal strategy instead of a more optimal but more com...
متن کاملA Hybrid Projection Algorithm for Finding Solutions of Mixed Equilibrium Problem and Variational Inequality Problem
Copyright q 2010 Filomena Cianciaruso et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We propose a modified hybrid projection algorithm to approximate a common fixed point of a k-strict pseudocontraction and of two sequence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2011
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-011-9407-1